Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
331	Probabilistic Checking of Proofs and Hardness of Approximation Problems Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2005-03-10 11:31:01 Probabilistic complexity theory Mathematical optimization Probabilistically checkable proof Sanjeev Arora PCP theorem Complexity classes MAX-3SAT Hardness of approximation NP Theoretical computer science Applied mathematics Computational complexity theory
332	The space complexity of approximating the frequency moments Noga Alon Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2002-02-21 20:13:33 Probabilistic complexity theory Analysis of algorithms Randomized algorithm Communication complexity Logarithm SL Random self-reducibility Counting points on elliptic curves Theoretical computer science Applied mathematics Computational complexity theory
333	RANDOM SAMPLING IN GRAPH OPTIMIZATION PROBLEMS Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-10-17 00:28:32 Spanning tree Algorithms Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
334	The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2003-11-26 11:19:12 Complexity classes Probabilistic complexity theory NP IP Interactive proof system Bounded-error probabilistic polynomial PP Randomized algorithm XTR Theoretical computer science Computational complexity theory Applied mathematics
335	COM S 6810 Theory of Computing March 24, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-03-26 12:29:21 Applied mathematics Complexity classes Arthur–Merlin protocol Probabilistic complexity theory Zero-knowledge proof IP NP Proof of knowledge Interactive proof system Theoretical computer science Cryptography Cryptographic protocols
336	Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗ Add to Reading List Source URL: web.cs.elte.hu Language: English - Date: 2007-01-10 14:31:22 Complexity classes Probabilistic complexity theory Mathematical optimization Mathematical proofs Interactive proof system NP Probabilistically checkable proof P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
337	Proofs that Yield Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2007-09-05 09:58:11 Complexity classes Cryptographic protocols Probabilistic complexity theory Models of computation Interactive proof system Zero-knowledge proof NP IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics
338	[removed]CS 710: Complexity Theory Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-05-07 01:12:20 Complexity classes Graph isomorphism problem NP Computing the permanent P Graph coloring Matching Bounded-error probabilistic polynomial Graph isomorphism Theoretical computer science Mathematics Computational complexity theory
339	On Smale’s 17th Problem: A Probabilistic Positive Solution. Carlos Beltr´an Add to Reading List Source URL: personales.unican.es Language: English - Date: 2011-06-09 07:23:01 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Time complexity Polynomial IP Universal property PP Dirac delta function Theoretical computer science Computational complexity theory Applied mathematics
340	PDF Document Add to Reading List Source URL: qav.cs.ox.ac.uk Language: English - Date: 2011-05-07 05:01:22 PP Quantum complexity theory Probabilistic method PRISM model checker Model checking Theoretical computer science Computational complexity theory Applied mathematics

UPDATE